Extensional Higher-Order Resolution
نویسندگان
چکیده
In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principles – necessary for the completeness result – by specialized (goal-directed) inference rules is of practical applicability, as an implentation of the calculus in the Leo-System shows. Furthermore, we prove the long-standing conjecture, that it is sufficient to restrict the order of primitive substitutions to the order of input for-
منابع مشابه
Comparing Approaches To Resolution Based Higher-Order Theorem Proving
We investigate several approaches to resolution based automated theorem proving in classical higher-order logic (based on Church’s simply typed λ-calculus) and discuss their requirements with respect to Henkin completeness and full extensionality. In particular we focus on Andrews’ higher-order resolution (Andrews 1971), Huet’s constrained resolution (Huet 1972), higher-order E-resolution, and ...
متن کاملProof Procedures for Extensional Higher-Order Logic Programming
We consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of first-order logic programming to apply to the more general higher-order case. We then enhance our s...
متن کاملExtensional Higher-Order Paramodulation and RUE-Resolution
This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order (FO) paramodulation [RW69] , and a calculus ERUE adapting FO RUE-Resolution [Dig79] to classical type theory, i.e., HO logic based on Church’s simply typed λ-calculus. EP and ERUE extend the extensional HO resolution approach ER [BK98a...
متن کاملEquality and extensionality in automated higher order theorem proving
This thesis focuses on equality and extensionality in automated higher-order theorem proving based on Church's simply typed -calculus (classical type theory). First, a landscape of various semantical notions is presented that is motivated by the di erent roles equality adopts in them. Each of the semantical notions in this landscape | including Henkin semantics | is then linked with an abstract...
متن کاملRewriting with Extensional Polymorphic λ-calculus
We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over proposition and the constant True. This result is an important step towards a new theory of reduction base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998